Deadlock Behaviour in Split and ST Bisimulation Semantics
نویسندگان
چکیده
We investigate split and ST bisimulation semantics, in particular the deadlock behaviour of processes in these semantics. \"le define and axiomatise a variant of ACP, where atomic actions and durational actions coexist, and define split and ST bisimulation semantics on this theory. We exhibit a closed term that has a deadlock in split semantics, but not in ST bisimulation semantics, and vice versa: a closed term that has a deadlock in ST bisimulation semantics but not in split semantics. As an application, we investigate different versions of durational communication.
منابع مشابه
Relating maximality-based semantics to action refinement in process algebras
This paper extends to process algebras the notion of maximality which has initially been introduced for prime event structures and P/T nets and shows how this notion of maximality may be used for deening an adequate semantics of Basic LOTOS able to support action reenement. Such an approach appears to be more convenient than the classical ST-semantics where non atomic actions are split into sta...
متن کاملSplit and ST Bisimulation Semantics
In this paper the notion of action atomicity is relaxed by permitting actions to be observed in the middle of their evolution. Non atomic semantic equivalences, based on the notion of bisimulation, are studied over stable event structures. Splitn bisimulation equivalence (denoted n ) considers each event as composed of n phases. ST bisimulation equivalence (denoted ST ) is a slight refinement o...
متن کاملSyntax , Semantics , Equivalences , and Axioms for MTIPP
The stochastic process algebra MTIPP has emerged from research in the field of process descriptions for random behaviour through time. This calculus has recently been shown to allow the calculation of performance measures (e.g. response times), purely functional statements (e.g. occurrences of deadlocks), as well as combined statements (e.g. optimal timeout values) [9, 11]. In contrast to class...
متن کاملDeconstructing CCS and CSP Asynchronous Communication, Fairness, and Full Abstraction
The process algebras CCS and CSP assume that processes interact by means of handshake communication, although it would have been equally reasonable to have adopted asynchronous communication as primitive. Traditional semantics of CCS (based on bisimulation) and CSP (such as the failures model) do not assume fair parallel composition, although fairness is often vital in ensuring liveness propert...
متن کاملMarkovian Processes Go Algebra
We propose a calculus MPA for reasoning about random behaviour through time. In contrast to classical calculi each atomic action is supposed to happen after a delay that is characterized by a certain exponentially distributed random variable. The operational semantics of the calculus deenes markovian labelled transition systems as a combination of classical action-oriented transition systems an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 16 شماره
صفحات -
تاریخ انتشار 1998